全文获取类型
收费全文 | 1199篇 |
免费 | 67篇 |
国内免费 | 2篇 |
专业分类
化学 | 692篇 |
晶体学 | 5篇 |
力学 | 26篇 |
数学 | 333篇 |
物理学 | 212篇 |
出版年
2023年 | 10篇 |
2022年 | 13篇 |
2021年 | 17篇 |
2020年 | 18篇 |
2019年 | 31篇 |
2018年 | 33篇 |
2017年 | 28篇 |
2016年 | 90篇 |
2015年 | 44篇 |
2014年 | 51篇 |
2013年 | 85篇 |
2012年 | 101篇 |
2011年 | 110篇 |
2010年 | 51篇 |
2009年 | 49篇 |
2008年 | 77篇 |
2007年 | 59篇 |
2006年 | 60篇 |
2005年 | 55篇 |
2004年 | 38篇 |
2003年 | 29篇 |
2002年 | 18篇 |
2001年 | 11篇 |
2000年 | 13篇 |
1999年 | 3篇 |
1998年 | 8篇 |
1997年 | 6篇 |
1996年 | 9篇 |
1995年 | 8篇 |
1994年 | 7篇 |
1993年 | 10篇 |
1992年 | 3篇 |
1991年 | 12篇 |
1990年 | 14篇 |
1989年 | 12篇 |
1988年 | 5篇 |
1987年 | 12篇 |
1986年 | 6篇 |
1985年 | 2篇 |
1984年 | 10篇 |
1983年 | 5篇 |
1982年 | 3篇 |
1981年 | 7篇 |
1980年 | 8篇 |
1979年 | 2篇 |
1978年 | 6篇 |
1973年 | 2篇 |
1972年 | 3篇 |
1971年 | 3篇 |
1963年 | 4篇 |
排序方式: 共有1268条查询结果,搜索用时 62 毫秒
71.
Michał Dobrski 《Central European Journal of Physics》2007,5(3):313-323
In this paper we introduce a method for finding a time independent Hamiltonian of a given Hamiltonian dynamical system by
canonoid transformation of canonical momenta. We find a condition that the system should satisfy to have an equivalent time
independent formulation. We study the example of a damped harmonic oscillator and give the new time independent Hamiltonian
for it, which has the property of tending to the standard Hamiltonian of the harmonic oscillator as damping goes to zero.
相似文献
72.
Michaël Balan 《Transformation Groups》2013,18(2):329-359
We consider a desingularization Γ of a Richardson variety in the variety of complete flags, obtained as a fibre of a projection from a certain Bott-Samelson variety Z. For any projective embedding of Z via a complete linear system, we construct a basis of the homogeneous coordinate ring of Γ inside Z, indexed by combinatorial objects which we call w 0 -standard tableaux. 相似文献
73.
Teobald Kupka Michał Stachów Jakub Kaminsky Stephan P. A. Sauer 《Magnetic resonance in chemistry : MRC》2013,51(8):482-489
A linear correlation between isotropic nuclear magnetic shielding constants for seven model molecules (CH2O, H2O, HF, F2, HCN, SiH4 and H2S) calculated with 37 methods (34 density functionals, RHF, MP2 and CCSD(T)), with affordable pcS‐2 basis set and corresponding complete basis set results, estimated from calculations with the family of polarization‐consistent pcS‐n basis sets is reported. This dependence was also supported by inspection of profiles of deviation between CBS estimated nuclear shieldings and shieldings obtained with the significantly smaller basis sets pcS‐2 and aug‐cc‐pVTZ‐J for the selected set of 37 calculation methods. It was possible to formulate a practical approach of estimating the values of isotropic nuclear magnetic shielding constants at the CCSD(T)/CBS and MP2/CBS levels from affordable CCSD(T)/pcS‐2, MP2/pcS‐2 and DFT/CBS calculations with pcS‐n basis sets. The proposed method leads to a fairly accurate estimation of nuclear magnetic shieldings and considerable saving of computational efforts. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
74.
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in
or
. Our planar structures are actually fitted for a more general class of objects – (β,δ)-covered objects – which are not necessarily convex, see definition below. These structures are more efficient than alternative known structures, because they exploit the fatness of the objects. We then apply these structures to obtain efficient solutions to two problems: (i) finding a perfect containment matching between a set of points and a set of convex fat objects, and (ii) finding a piercing set for a collection of convex fat objects, whose size is optimal up to some constant factor. 相似文献
75.
76.
The overlay of 2≤m≤d minimization diagrams of n surfaces in ℝ
d
is isomorphic to a substructure of a suitably constructed minimization diagram of mn surfaces in ℝ
d+m−1. This elementary observation leads to a new bound on the complexity of the overlay of minimization diagrams of collections
of d-variate semi-algebraic surfaces, a tight bound on the complexity of the overlay of minimization diagrams of collections of
hyperplanes, and faster algorithms for constructing such overlays. Further algorithmic implications are discussed.
Work by V. Koltun was supported by NSF CAREER award CCF-0641402.
Work by M. Sharir was supported by NSF Grants CCR-00-98246 and CCF-05-14079, by a grant from the Israeli Academy of Sciences
for a Center of Excellence in Geometric Computing at Tel Aviv University, and by the Hermann Minkowski Minerva Center for
Geometry at Tel Aviv University. 相似文献
77.
The purpose of this paper is to find optimal estimates for the Green function of a half-space of the relativistic
α
-stable process with parameter m on ℝ
d
space. This process has an infinitesimal generator of the form mI–(m
2/α
I–Δ)
α/2, where 0<α<2, m>0, and reduces to the isotropic α-stable process for m=0. Its potential theory for open bounded sets has been well developed throughout the recent years however almost nothing
was known about the behaviour of the process on unbounded sets. The present paper is intended to fill this gap and we provide
two-sided sharp estimates for the Green function for a half-space. As a byproduct we obtain some improvements of the estimates
known for bounded sets. Our approach combines the recent results obtained in Byczkowski et al. (Bessel Potentials, Hitting
Distributions and Green Functions (2006) (preprint). ), where an explicit integral formula for the m-resolvent of a half-space was found, with estimates of the transition densities for the killed process on exiting a half-space.
The main result states that the Green function is comparable with the Green function for the Brownian motion if the points
are away from the boundary of a half-space and their distance is greater than one. On the other hand for the remaining points
the Green function is somehow related the Green function for the isotropic α-stable process. For example, for d≥3, it is comparable with the Green function for the isotropic α-stable process, provided that the points are close enough.
Research supported by KBN Grants. 相似文献
78.
79.
We show that n lines in 3-space can be cut into
O(n2-1/69log16/69n) pieces, such that all depth cycles
defined by triples of lines are eliminated. This partially resolves
a long-standing open problem in computational geometry, motivated by
hidden-surface removal in computer graphics. 相似文献
80.
We study subgroups of ℤℕ which possess group theoretic properties analogous to properties introduced by Menger (1924), Hurewicz (1925), Rothberger
(1938), and Scheepers (1996). The studied properties were introduced independently by Kočinac and Okunev. We obtain purely
combinatorial characterizations of these properties, and combine them with other techniques to solve several questions of
Babinkostova, Kočinac, and Scheepers.
The first author was supported by the EU Research and Training Network HPRN-CT-2002-00287.
The second author was partially supported by the Koshland Center for Basic Research. 相似文献